Phase semantics and decidability of elementary affine logic

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hybrid Intuitionistic Logic: Semantics and Decidability

An intuitionistic, hybrid modal logic suitable for reasoning about distribution of resources was introduced in [14, 15]. The modalities of the logic allow us to validate properties in a particular place, in some place and in all places. We give a sound and complete Kripke semantics for the logic extended with disjunctive connectives. The extended logic can be seen as an instance of Hybrid IS5. ...

متن کامل

Principal Typing in Elementary Affine Logic

Elementary Affine Logic (EAL) is a variant of the Linear Logic characterizing the computational power of the elementary bounded Turing machines. The EAL Type Inference problem is the problem of automatically assign to terms of λ-calculus EAL formulas as types. The problem is solved by showing that every λ-term which is typeable has a finite set of principal typing schemata, from which all and o...

متن کامل

Denotational Semantics for Propositional Light Affine Logic

Denotational semantics often make invariants explicit which are implicit in the structure of a proof theoretic system. Asperti’s Light Affine Logic is a proof theoretic system, which can be viewed as a computation model. It was shown by Asperti and Roversi that, as a computation model, it captures the feasible functions. Light Affine Logic is a simplification of Girard’s Light Linear Logic, to ...

متن کامل

Elementary Affine Logic and the Call-by-Value Lambda Calculus

Light and elementary linear logics have been introduced as logical systems enjoying quite remarkable normalization properties. Designing a type assignment system for pure lambda calculus from these logics, however, is problematic, as discussed in [1]. In this paper, we show that shifting from usual call-by-name to call-by-value lambda calculus allows to regain strong connections with the underl...

متن کامل

Topological Semantics and Decidability

It is well-known that the basic modal logic of all topological spaces is S4. However, the structure of basic modal and hybrid logics of classes of spaces satisfying various separation axioms was until present unclear. We prove that modal logics of T0, T1 and T2 topological spaces coincide and are S4. We also examine basic hybrid logics of these classes and prove their decidability; as part of t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2004

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2004.02.037